PAGER-M: A Novel Location-based Routing Protocol for Mobile Sensor Networks

In this paper we present a location-based routing protocol called Partial-partition Avoiding Geographic Routing-Mobile (PAGER-M), for mobile sensor networks that consist of frequently moving sensors. The protocol uses the location information of sensors and the base station to assign a cost function to each sensor node, which is close to the Euclidean length of a sensor node’s shortest path to the base station. A packet is forwarded to the base station using greedy forwarding whenever possible. When a packet reaches sensor nodes near local minimums, where greedy forwarding will be impossible after a number of hops, the packet is forwarded following the high-cost-to-lowcost rule. Extensive simulations are used to compare the performance of PAGER-M with Greedy Perimeter Stateless Routing (GPSR) and Ad-hoc On-demand Distance Vector protocol (AODV) in mobile sensor networks. Experimental results show that PAGER-M achieves higher delivery ratio, lower routing overhead and lower energy consumption.